Iterative algorithms for determining optimal solution set of interval linear fractional programming problem

Determining the optimal solution (OS) set of interval linear fractional programming (ILFP) models is generally an NP-hard problem. Few methods have been proposed in this field which only able to obtain value objective function. Thus, there a need for appropriate method determine OS ILFP model. In paper, we introduce three algorithms ILFP. first and second algorithms, using definition strong weak feasible solutions, function has transformed on largest region (LFR) These two one point as OS. Since model, seek algorithm, where time obtained by solving sub-models. Hence, transform model into pessimistic optimistic sub-models, smallest (SFR) other LFR. We add constraints ensure that feasible. Then, modified (PMOM) algorithm. each PMOM solved separately. The OSs from these give so Note union will be more complete set.